The Generalized Gradient at a Multiple Eigenvalue
نویسندگان
چکیده
منابع مشابه
The Generalized Gradient at a Multiple Eigenvalue
When a symmetric, positive, isomorphism between a reeexive Banach space (that is densely and compactly embedded in a Hilbert space) and its dual varies smoothly over a Banach space, its eigenvalues vary in a Lipschitz manner. We calculate the generalized gradient of the extreme eigenvalues at an arbitrary crossing. We apply this to the generalized gradient, with respect to a coeecient in an ell...
متن کاملOn the condition numbers of a multiple eigenvalue of a generalized eigenvalue problem
For standard eigenvalue problems, closed-form expressions for the condition numbers of a multiple eigenvalue are known. In particular, they are uniformly 1 in the Hermitian case and generally take different values in the non-Hermitian case. We consider the generalized eigenvalue problem and identify the condition numbers. Our main result is that a multiple eigenvalue generally has multiple cond...
متن کاملA New Inexact Inverse Subspace Iteration for Generalized Eigenvalue Problems
In this paper, we represent an inexact inverse subspace iteration method for computing a few eigenpairs of the generalized eigenvalue problem Ax = Bx [Q. Ye and P. Zhang, Inexact inverse subspace iteration for generalized eigenvalue problems, Linear Algebra and its Application, 434 (2011) 1697-1715 ]. In particular, the linear convergence property of the inverse subspace iteration is preserved.
متن کاملComputational aspect to the nearest southeast submatrix that makes multiple a prescribed eigenvalue
Given four complex matrices $A$, $B$, $C$ and $D$ where $Ainmathbb{C}^{ntimes n}$ and $Dinmathbb{C}^{mtimes m}$ and let the matrix $left(begin{array}{cc} A & B C & D end{array} right)$ be a normal matrix and assume that $lambda$ is a given complex number that is not eigenvalue of matrix $A$. We present a method to calculate the distance norm (with respect to 2-norm) from $D$ to ...
متن کاملA New Hybrid Conjugate Gradient Method Based on Eigenvalue Analysis for Unconstrained Optimization Problems
In this paper, two extended three-term conjugate gradient methods based on the Liu-Storey ({tt LS}) conjugate gradient method are presented to solve unconstrained optimization problems. A remarkable property of the proposed methods is that the search direction always satisfies the sufficient descent condition independent of line search method, based on eigenvalue analysis. The globa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Functional Analysis
سال: 1995
ISSN: 0022-1236
DOI: 10.1006/jfan.1995.1117